PDEs for Morphological Scale-Spaces and Eikonal Applications
نویسنده
چکیده
In contrast to the all-discrete approaches that dominated image processing in the recent past, in computer vision since the mid 1980’s there have been proposed continuous models for several vision tasks based on partial differential equations (PDEs). The discrete part of such approaches comes only in the corresponding difference equations (numerical algorithms) that approximate the solution of these PDEs. Motivations for using PDEs in image analysis and vision include better and more intuitive mathematical modeling, connections with physics, better approximation to the Euclidean geometry of the problem, and existence of efficient numerical algorithms for solving them. One major effort [31] was the use of PDEs in problems of shape from shading and optical flow. However, the most well known vision problem modeled via PDEs is that of multiscale image analysis, i.e. scale-spaces. While many such continuous approaches have been linear, the majority and the most useful ones are nonlinear. Several classes of nonlinear PDEs used in image analysis and vision are based on or related to morphological operations. Morphological image processing has been based traditionally on modeling images as sets or as points in a complete lattice of functions and viewing morphological image transformations as set or lattice operators. Thus, the two classic approaches to analyze or design the deterministic systems of mathematical morphology have been (i) geometry by viewing them as image set transformations in Euclidean spaces and (ii) algebra to analyze their properties using set or lattice theory. Geometry was used mainly for intuitive understanding, and algebra was restricted to the space domain. Despite their limitations, these approaches have produced a powerful and self-contained broad collection of nonlinear image analysis concepts, operators and algorithms, which have found a broad range of applications in image processing and computer vision; see [73, 49, 28] and Chapter 3.3 of this book for surveys and references. In parallel to these directions, there is a growing part of morphological image processing that is based on ideas from differential calculus and dynamical systems. It combines some early ideas on morpholological signal gradients and some recent ideas on using differential equations to model nonlinear multiscale processes or distance propagation in images. In this chapter we present a unified view of the various interrelated ideas in this area, using occasionally some systems analysis tools in both the space and the slope transform domain. Among the few early connections between morphology and calculus were the morphological gradients. Specifically, given a function f : Rm → R, with m = 1, 2, its isotropic morphological sup-derivative at a point x is defined by
منابع مشابه
Mathematical Morphology and Eikonal Equations on Graphs for Nonlocal Image and Data Processing
Mathematical morphology (MM) offers a wide range of operators to address various image processing problems. These operators can be defined in terms of algebraic (discrete) sets or as partial differential equations (PDEs). In this paper, we introduce a novel formulation of MM formalized as a framework of partial difference equations (PdEs) over weighted graphs of arbitrary topology. Then, we pre...
متن کاملAdaptation of Eikonal Equation over Weighted Graph
In this paper, an adaptation of the eikonal equation is proposed by considering the latter on weighted graphs of arbitrary structure. This novel approach is based on a family of discrete morphological local and nonlocal gradients expressed by partial difference equations (PdEs). Our formulation of the eikonal equation on weighted graphs generalizes local and nonlocal configurations in the conte...
متن کاملTwo Frontiers in Morphological Image Analysis: Differential Evolution Models and Hybrid Morphological/linear Neural Networks
In this paper we briefly describe advancements in two broad areas of morphological image analysis. Part I deals with differential morphology and curve evolution. The partial differential equations (PDEs) that model basic morphological operations are first presented. The resulting dilation PDE, numerically implemented by curve evolution algorithms, improves the accuracy of morphological multisca...
متن کاملFast Marching Methods for Stationary Hamilton-Jacobi Equations with Axis-Aligned Anisotropy
The fast marching method (FMM) has proved to be a very efficient algorithm for solving the isotropic Eikonal equation. Because it is a minor modification of Dijkstra’s algorithm for finding the shortest path through a discrete graph, FMM is also easy to implement. In this paper we describe a new class of Hamilton–Jacobi (HJ) PDEs with axis-aligned anisotropy which satisfy a causality condition ...
متن کاملEfficient segmentation based on Eikonal and diffusion equations
Segmentation of regions of interest in an image has important applications in medical image analysis, particularly in computer aided diagnosis. Segmentation can enable further quantitative analysis of anatomical structures. We present efficient image segmentation schemes based on the solution of distinct partial differential equations (PDEs). For each known image region, a PDE is solved, the so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005